Drafting a Reference Collection Policy

Drafting.

Heap Garbage Collection with Reference Counting

In algorithms based on reference counting, a garbage-collection decision has to be made whenever a pointer x→ y is about to be destroyed. At this time, the node y may become dead even if y’s reference count is not zero. This is because y may belong to a piece of cyclic garbage. Some aggressive collection algorithms will put y on the list of potential garbage regardless of y’s reference count. L...

Concurrent Cycle Collection in Reference Counted Systems

Automatic storage reclamation via reference counting has important advantages, but has always suffered from a major weakness due to its inability to reclaim cyclic data structures. We describe a novel cycle collection algorithm that is both concurrent — it is capable of collecting garbage even in the presence of simultaneous mutation — and localized — it never needs to perform a global search o...

Weeding the Reference Collection: a Review of the Literature

the actual mechanics of performing this activity vary widely and is the cause of much concern in libraries. Furthermore, the actual decision process for selecting an item to be culled from the primary collection is not fixed, and varies according to the type of library under study and/or to the mandate of the library. Thus, the approach to weeding taken by a small public library has an outcome ...

Drafting with Sequences

The numbers on the inner circle are those that exist in the modular arithmetic. If we continue beyond 7, as shown in the outer ring, the numbers wrap around the wheel. Numbers on the same spoke are equivalent. For example, 0 and 8 are equivalent, 1 and 9 are equivalent, 2 and 10 are equivalent, and so on. Another way to look at it is that when 9 is introduced into modular arithmetic with 8 shaf...